k = int(input())
l = int(input())
num = 1
if k == l:
print('YES\n0')
exit()
output = ''
while k ** num < l:
num += 1
if k ** num > l:
output += 'NO'
break
elif k ** num == l:
output += 'YES\n'
output += str(num - 1)
if output == '':
print('NO')
else:
print(output)#include<iostream>
using namespace std;
int main()
{
long long k, l;
cin >> k >> l;
long long count = 0;
if (l % k == 0)
{
while (l != k && l > 0)
{
if (l % k != 0)
{
cout << "NO";
return 0;
}
l /= k;
++count;
}
}
else
{
cout << "NO";
return 0;
}
cout <<"YES\n"<< count;
}3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |
Differences of the permutations | Doctor's Secret |